Structured Estimation with Atomic Norms: General Bounds and Applications

نویسندگان

  • Sheng Chen
  • Arindam Banerjee
چکیده

For structured estimation problems with atomic norms, recent advances in the literature express sample complexity and estimation error bounds in terms of certain geometric measures, in particular Gaussian width of the unit norm ball, Gaussian width of a spherical cap induced by a tangent cone, and a restricted norm compatibility constant. However, given an atomic norm, bounding these geometric measures can be difficult. In this paper, we present general upper bounds for such geometric measures, which only require simple information of the atomic norm under consideration, and we establish tightness of these bounds by providing the corresponding lower bounds. We show applications of our analysis to certain atomic norms, especially k-support norm, for which existing result is incomplete.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Learning for Structured Loss Spaces

We consider prediction with expert advice when the loss vectors are assumed to lie in a set described by the sum of atomic norm balls. We derive a regret bound for a general version of the online mirror descent (OMD) algorithm that uses a combination of regularizers, each adapted to the constituent atomic norms. The general result recovers standard OMD regret bounds, and yields regret bounds fo...

متن کامل

Structured Matrix Recovery via the Generalized Dantzig Selector

In recent years, structured matrix recovery problems have gained considerable attention for its real world applications, such as recommender systems and computer vision. Much of the existing work has focused on matrices with low-rank structure, and limited progress has been made on matrices with other types of structure. In this paper we present non-asymptotic analysis for estimation of general...

متن کامل

Regularization and the small-ball method II: complexity dependent error rates

For a convex class of functions F , a regularization functions Ψ(·) and given the random data (Xi, Yi) N i=1, we study estimation properties of regularization procedures of the form f̂ ∈ argmin f∈F ( 1 N N ∑ i=1 ( Yi − f(Xi) )2 + λΨ(f) ) for some well chosen regularization parameter λ. We obtain bounds on the L2 estimation error rate that depend on the complexity of the “true model” F ∗ := {f ∈ ...

متن کامل

On Integral Operator and Argument Estimation of a Novel Subclass of Harmonic Univalent Functions

Abstract. In this paper we define and verify a subclass of harmonic univalent functions involving the argument of complex-value functions of the form f = h + ¯g and investigate some properties of this subclass e.g. necessary and sufficient coefficient bounds, extreme points, distortion bounds and Hadamard product.Abstract. In this paper we define and verify a subclass of harmonic univalent func...

متن کامل

Atomic Decompositions of Fuzzy Normed Linear Spaces for Wavelet Applications

Wavelet analysis is a powerful tool withmodern applications as diverse as: image processing, signal processing, data compression, data mining, speech recognition, computer graphics, etc. The aim of this paper is to introduce the concept of atomic decomposition of fuzzy normed linear spaces, which play a key role in the development of fuzzy wavelet theory. Atomic decompositions appeared in appli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015